On the Dead End Depth of Thompson’s Group F
نویسنده
چکیده
Thompson’s group F was introduced by Richard Thompson in the 1960’s and has since found applications in many areas of mathematics including algebra, logic and topology. We focus on the dead end depth of F , which is the minimal integer N such that for any group element, g, there is guaranteed to exist a path of length at most N in the Cayley graph of F leading from g to a point farther from the identity than g is. By viewing F as a diagram group, we improve the greatest known lower bound for the dead end depth of F with respect to the standard consecutive generating sets.
منابع مشابه
Unusual Geodesics in Generalizations of Thompson’s Group F
We prove that seesaw words exist in Thompson’s Group F (N) for N = 2, 3, 4, ... with respect to the standard finite generating set X. A seesaw word w with swing k has only geodesic representatives ending in g or g−k (for given g ∈ X) and at least one geodesic representative of each type. The existence of seesaw words with arbitrarily large swing guarantees that F (N) is neither synchronously co...
متن کاملStrict Dead End Elements in Free Soluble Groups
Let G be a group generated by a finite set A. An element g ∈ G is a strict dead end of depth k (with respect to A) if |g| > |ga1| > |ga1a2| > · · · > |ga1a2 · · · ak| for any a1, a2, . . . , ak ∈ A such that the word a1a2 · · ·ak is freely irreducible. (Here |g| is the distance from g to the identity in the Cayley graph of G.) We show that in finitely generated free soluble groups of degree d ≥...
متن کاملSean Cleary and Jennifer Taback
We study some combinatorial properties of the word metric of Thompson’s group F in the standard two generator finite presentation. We explore connections between the tree pair diagram representing an element w of F , its normal form in the infinite presentation, its word length, and minimal length representatives of it. We estimate word length in terms of the number and type of carets in the tr...
متن کاملJu n 20 04 A finitely presented group with infinite dead end depth
The dead end depth of an element g of a group G with finite generating set A is the distance from g to the complement of the radius dA(1, g) closed ball, in the word metric dA defined with respect to A. We say that G has infinite dead end depth when dead end depth is unbounded, ranging over G. We exhibit a finitely presented group G with a finite generating set, with respect to which G has infi...
متن کاملSome Remarks on Depth of Dead Ends in Groups
It is known, that the existence of dead ends (of arbitrary depth) in the Cayley graph of a group depends on the chosen set of generators. Nevertheless there exist many groups, which do not have dead ends of arbitrary depth with respect to any set of generators. Partial results in this direction were obtained by Šunić and by Warshall. We improve these results by showing that abelian groups only ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012